OCTAL: Optimal Completion of gene trees in polynomial time
نویسندگان
چکیده
منابع مشابه
Optimal Completion of Incomplete Gene Trees in Polynomial Time Using OCTAL
Here we introduce the Optimal Tree Completion Problem, a general optimization problem that involves completing an unrooted binary tree (i.e., adding missing leaves) so as to minimize its distance from a reference tree on a superset of the leaves. More formally, given a pair of unrooted binary trees (T, t) where T has leaf set S and t has leaf set R ⊆ S, we wish to add all the leaves from S \R t...
متن کاملClosing the gap: near-optimal Steiner trees in polynomial time
The minimum rectilinear Steiner tree (MRST) problem arises in global routing and wiring estimation, as well as in many other areas. The MRST problem is known to be NPhard, and the best performing MRST heuristic to date is the Iterated 1-Steiner (IIS) method recently proposed by Kahng and Robins. In this paper, we develop a straightforward, efficient implementation of IIS, achieving a speedup fa...
متن کاملTreeCmp: Comparison of Trees in Polynomial Time
When a phylogenetic reconstruction does not result in one tree but in several, tree metrics permit finding out how far the reconstructed trees are from one another. They also permit to assess the accuracy of a reconstruction if a true tree is known. TreeCmp implements eight metrics that can be calculated in polynomial time for arbitrary (not only bifurcating) trees: four for unrooted (Matching ...
متن کاملA Polynomial-Time Metric for Attributed Trees
We address the problem of comparing attributed trees and propose a novel distance measure centered around the notion of a maximal similarity common subtree. The proposed measure is general and defined on trees endowed with either symbolic or continuous-valued attributes, and can be equally applied to ordered and unordered, rooted and unrooted trees. We prove that our measure satisfies the metri...
متن کاملOptimal Consistent Network Updates in Polynomial Time
Software-defined networking (SDN) enables controlling the behavior of a network in software, by managing the the forwarding rules installed on switches. However, it can be difficult to ensure that certain properties are preserved during periods of reconfiguration. The widelyaccepted notion of per-packet consistency requires every packet to be forwarded using the new configuration or the old con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms for Molecular Biology
سال: 2018
ISSN: 1748-7188
DOI: 10.1186/s13015-018-0124-5